Search results
90 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
A JavaScript library for converting between different naming styles of identifiers.
A lightweight JavaScript package for converting strings between different casing styles such as lowercase, uppercase, title case, and sentence case.
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Lightweight and performant natural sorting of arrays and collections by differentiating between unicode characters, numbers, dates, etc.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
A light weight package for object and array manipulation. As well as some utilities for matching text.
All mismatch between two strings
Convert strings between different variable naming formats
A simple library to validate different inputs and strings
A module that calculates and returns the differences between two input strings.
Return the index of first difference occurence between given string, number or array
Takes two arrays of strings, differently delimited (but identical otherwise) and gives you the mapping between them.
A producer Node stream for draining different data, including Readable streams
Diff any array-like object, including strings
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
- levenshtein
- levenshtein-wasm
- levenshtein-distance
- distance
- algorithm
- assemblyscript
- wasm
- webassembly
- string
- compare
- fast
- fastest
- match
- difference
url-parse-modify is a JavaScript library designed for parsing and manipulating URLs easily. It can be used in both browser-based and Node.js applications. This library simplifies the process of working with URLs, allowing you to extract and modify differe